Counting chemical compositions using Ehrhart quasi-polynomials

نویسندگان

  • Shane L. Hubler
  • Gheorghe Craciun
چکیده

To count the number of chemical compositions of a particular mass, we consider an alphabet A with a mass function which assigns a mass to each letter in A. We then compute the mass of a word (an ordered sequence of letters) by adding the masses of the constituent letters. Our main interest is to count the number of words that have a particular mass, where we ignore the order of the letters within the word. We show first that counting the number of words of a given mass has a geometric interpretation, whose solutions are called Ehrhart quasi-polynomials, a class of functions defined on integers. These special functions are “periodic” in the sense that they use the same polynomial every λ steps. In addition to discovering the connection between counting compositions and Ehrhart quasi-polynomials, we also find number theoretic results that greatly reduce the number of candidates for the period, λ. Finally, we illustrate the usefulness of these results and the use of a software library named barvinok (by Verdoolaege et al.) by applying them to eight different classes of chemical compositions, including organic molecules, peptides, DNA, and RNA.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finding Bounds on Ehrhart Quasi-Polynomials

Numerous problems in program analysis, can be reduced to finding bounds on the number of integer points in a convex set, or the solution of a more general polyhedral counting problem. For a large class of applications the solution of such a counting problem can be expressed as a piecewise Ehrhart quasi-polynomial in the parameters. This work presentsmethods to find bounds on quasi-polynomials o...

متن کامل

Maximal Periods of ( Ehrhart ) Quasi - Polynomials 3

A quasi-polynomial is a function defined of the form q(k) = c d (k) k d + c d−1 (k) k d−1 + · · · + c0(k), where c0, c1,. .. , c d are periodic functions in k ∈ Z. Prominent examples of quasi-polynomials appear in Ehrhart's theory as integer-point counting functions for rational polytopes, and McMullen gives upper bounds for the periods of the cj (k) for Ehrhart quasi-polynomials. For generic p...

متن کامل

0 M ay 2 00 7 MAXIMAL PERIODS OF ( EHRHART ) QUASI - POLYNOMIALS

A quasi-polynomial is a function defined of the form q(k) = c d (k) k d + c d−1 (k) k d−1 + · · · + c0(k), where c0, c1,. .. , c d are periodic functions in k ∈ Z. Prominent examples of quasi-polynomials appear in Ehrhart's theory as integer-point counting functions for rational polytopes, and McMullen gives upper bounds for the periods of the cj (k) for Ehrhart quasi-polynomials. For generic p...

متن کامل

Maximal periods of (Ehrhart) quasi-polynomials

A quasi-polynomial is a function defined of the form q(k) = cd(k) k d + cd−1(k) k d−1 + · · · + c0(k), where c0, c1, . . . , cd are periodic functions in k ∈ Z. Prominent examples of quasipolynomials appear in Ehrhart’s theory as integer-point counting functions for rational polytopes, and McMullen gives upper bounds for the periods of the cj(k) for Ehrhart quasi-polynomials. For generic polyto...

متن کامل

A Finite Calculus Approach to Ehrhart Polynomials

A rational polytope is the convex hull of a finite set of points in Rd with rational coordinates. Given a rational polytope P ⊆ Rd, Ehrhart proved that, for t ∈ Z>0, the function #(tP ∩ Zd) agrees with a quasi-polynomial LP(t), called the Ehrhart quasi-polynomial. The Ehrhart quasi-polynomial can be regarded as a discrete version of the volume of a polytope. We use that analogy to derive a new ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014